A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games

The price of anarchy (PoA) is a standard measure to quantify the inefficiency equilibria in nonatomic congestion games. Most publications have focused on worst-case bounds for PoA. Only few analyzed sensitivity PoA against changes demands or cost functions, although that crucial empirical computations We analyze with respect (w.r.t.) simultaneous and functions. key this analysis metric distance between two games defines topological space consisting all same combinatorial structure. then locally pointwise Hölder continuous function we exponent different classes also apply our approach convergence when total demand tends zero infinity. Our results further develop recent seminal work w.r.t. only under special conditions.